au.\*:("Arun-Kumar, S")
Results 1 to 25 of 53
Selection :
FSTTCS 2006 (foundations of software technology and theoretical computer science)Arun-Kumar, S; Garg, Naveen.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-49994-6, 1Vol, XIII-430 p, isbn 3-540-49994-6Conference Proceedings
Hennessy-plotkin-brookes revisitedPLOTKIN, Gordon.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-49994-6, 1Vol, p. 4Conference Paper
Rational behaviour and strategy construction in infinite multiplayer gamesUMMELS, Michael.Lecture notes in computer science. 2006, pp 212-223, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
Safely freezing LTLLAZIC, Ranko.Lecture notes in computer science. 2006, pp 381-392, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
Game semantics for higher-order concurrencyLAIRD, J.Lecture notes in computer science. 2006, pp 417-428, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
Shared-variable concurrency : A proposaiBOUDOL, Gérard.Lecture notes in computer science. 2006, pp 1-3, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 3 p.Conference Paper
Linear-time algorithms for two subtree-comparison problems on phylogenetic trees with different speciesHSIEH, Sun-Yuan.Lecture notes in computer science. 2006, pp 164-175, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
The number of crossing free configurations on finite point sets in the planeWELZL, Emo.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-49994-6, 1Vol, p. 20Conference Paper
Tree automata make ordinal theory easyCACHAT, Thierry.Lecture notes in computer science. 2006, pp 285-296, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
Coresets for discrete integration and clusteringHAR-PELED, Sariel.Lecture notes in computer science. 2006, pp 33-44, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
An efficiency preorder for processes = Un préordre efficace pour les processusARUN-KUMAR, S; HENNESSY, M.Acta informatica. 1992, Vol 29, Num 8, pp 737-760, issn 0001-5903Article
Fair derivations in EOL systemsRANGARAJAN, K; ARUN-KUMAR, S.Information processing letters. 1985, Vol 20, Num 4, pp 183-188, issn 0020-0190Article
Expressivity properties of boolean BI through relational modelsGALMICHE, Didier; LARCHEY-WENDLING, Dominique.Lecture notes in computer science. 2006, pp 357-368, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
Fast edge colorings with fixed number of colors to minimize imbalanceCALINESCU, Gruia; PELSMAJER, Michael J.Lecture notes in computer science. 2006, pp 117-128, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
One-input-face MPCVP is hard for L, but in LogDCFLCHAKRABORTY, Tanmoy; DATTA, Samir.Lecture notes in computer science. 2006, pp 57-68, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
The anatomy of innocence revisitedHARMER, Russ; LAURENT, Olivier.Lecture notes in computer science. 2006, pp 224-235, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
Validity checking for finite automata over linear arithmetic constraintsWASSERMANN, Gary; ZHENDONG SU.Lecture notes in computer science. 2006, pp 405-416, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
Branching pushdown tree automataALUR, Rajeev; CHAUDHURI, Swarat.Lecture notes in computer science. 2006, pp 393-404, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
On obtaining pseudorandomness from error-correcting codesKALYANARAMAN, Shankar; UMANS, Christopher.Lecture notes in computer science. 2006, pp 105-116, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
Normal and feature approximations from noisy point cloudsDEY, Tamal K; JIAN SUN.Lecture notes in computer science. 2006, pp 21-32, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
Unbiased rounding of rational matricesDOERR, Benjamin; KLEIN, Christian.Lecture notes in computer science. 2006, pp 200-211, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper
Approximation algorithms for 2-stage stochastic optimization problemsSWAMY, Chaitanya; SHMOYS, David B.Lecture notes in computer science. 2006, pp 5-19, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 15 p.Conference Paper
Amortised bisimulationsKIEHN, Astrid; ARUN-KUMAR, S.Lecture notes in computer science. 2005, pp 320-334, issn 0302-9743, isbn 3-540-29189-X, 1Vol, 15 p.Conference Paper
Exact quantum-statistical dynamics of an oscillator with time-dependent frequency and generation of nonclassical statesAGARWAL, G. S; ARUN KUMAR, S.Physical review letters. 1991, Vol 67, Num 26, pp 3665-3668, issn 0031-9007Article
Computationally sound symbolic secrecy in the presence of hash functionsCORTIER, Véronique; KREMER, Steve; KUSTERS, Ralf et al.Lecture notes in computer science. 2006, pp 176-187, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper